Resolving P(v, 3, λ) designs into regular P3-configurations
نویسندگان
چکیده
There is one nontrivial regular configuration on two paths of three vertices, and one on three paths. Path designs which are resolvable into copies of these configurations are shown to exist whenever basic numerical conditions are met, with a few possible exceptions.
منابع مشابه
Resolving Triple Systems into Regular Configurations
A λ − Triple System(v), or a λ–TS(V,B), is a pair (V, B) where V is a set and B is a subset of the 3-subsets of V so that every pair is in exactly λ elements of B. A regular configuration on p points with regularity ρ on l blocks is a pair (P,L) where L is a collection of 3-subsets of a (usually small) set P so that every p in P is in exactly ρ elements of L, and |L| = l. The Pasch configuratio...
متن کاملPartition of C 4-Designs into Minimum and Maximum Number of P 3-Designs
Let C be a C4-design of order n and index λ, on the vertex set V , |V | = n. If V1∪· · ·∪Vm = V is a partition of the vertex set, such that the intersections of the C ∈ C with Vi form a P3-design of order |Vi| and the same index λ, for each 1 ≤ i ≤ m, then 2 ≤ m ≤ log3(2n+1). The minimum bound is best possible for every λ. The maximum bound is best possible for λ = 2, and hence also for every e...
متن کاملCounting Configurations in Designs
Given a t-(v, k, λ) design, form all of the subsets of the set of blocks. Partition this collection of configurations according to isomorphism and consider the cardinalities of the resulting isomorphism classes. Generalizing previous results for regular graphs and Steiner triple systems, we give linear equations relating these cardinalities. For any fixed choice of t and k, the coefficients in ...
متن کاملResolving and Exploiting the $k$-CFA Paradox
semantics: k-CFA ((f e), β̂, σ̂, â) ; (e′, β̂′, σ̂′, â′), where Ê(f, β̂, σ̂) ∋ 〈(λ (x) e′), β̂′′〉 â′ = ⌊l · â⌋k Ê(e, β̂, σ̂) = d̂ β̂′ = β̂′′[x 7→ â′] σ̂′ = σ̂ ⊔ [â′ 7→ d̂] And: Ê(x, β̂, σ̂) = σ̂(β̂(x)) Ê((λ (x) e), β̂, σ̂) = {〈(λ (x) e), β̂〉} Resolving and Exploiting the k-CFA Paradox, New England Programming Language and Systems Sysmposium, MIT, December, 2009 – p.5/22 The Paradox of k-CFA Resolving and Exploiting ...
متن کاملBhaskar Rao designs over small groups
We show that for each of the groups S3, D4, Q4, Z4 x Z2 and D6 the necessary conditions are sufficient for the existence of a generalized Bhaskar Rao design. That is, we show that: (i) a GBRD (v, 3, λ; S3) exists if and only if λ ≡ O (mod 6 ) and λv(v 1) ≡ O(mod 24); (ii) if G is one of the groups D4, Q4, and Z4 x Z2, a GBRD (v, 3, λ; G) exists if and only if λ ≡ O(mod 8) and λv(v 1) ≡ O(mod 6)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2003